Minimum spanning tree

Results: 280



#Item
41Graph theory / Graph connectivity / Connectivity / Line graph / Graph / Minimum spanning tree / Bridge / Connected component / Vertex / Ear decomposition / Directed graph / Clustering coefficient

5 th AGILE Conference on Geographic Information Science, Palma (Mallorca, Spain) April 25th-27 thA Structural Approach to Model Generalisation of an Urban Street Network B. Jiang (1) and C. Claramunt (2) Division

Add to Reading List

Source URL: fromto.hig.se

Language: English - Date: 2003-01-29 04:29:41
42Machine learning / Image segmentation / Cluster analysis / Scene graph / Supervised learning / Pattern recognition / Planar graph / Belief propagation / Spectral clustering / Directed graph / Minimum spanning tree / Segmentation-based object categorization

figures/clust_result2.eps

Add to Reading List

Source URL: europa.informatik.uni-freiburg.de

Language: English - Date: 2010-12-20 07:33:58
43Graph theory / Graph / Line graph / Size / Minimum spanning tree / Image segmentation / Akaike information criterion / Conference on Computer Vision and Pattern Recognition / Binary star

Are Elephants Bigger than Butterflies? Reasoning about Sizes of Objects Hessam Bagherinezhad† and Hannaneh Hajishirzi† and Yejin Choi† and Ali Farhadi†‡ † University of Washington, ‡ Allen Institute for AI

Add to Reading List

Source URL: ai2-website.s3.amazonaws.com

Language: English - Date: 2016-05-10 13:04:37
44Graph theory / Mathematics / NP-complete problems / Spanning tree / Edsger W. Dijkstra / Routing algorithms / Search algorithms / Topology control / Unit disk graph / Connectivity / Minimum spanning tree / Bipartite graph

XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland

Add to Reading List

Source URL: disco.ethz.ch

Language: English
45Graph theory / Mathematics / Computational complexity theory / Spanning tree / NP-complete problems / Dominating set / Minimum spanning tree / Maximal independent set / Matching / Travelling salesman problem / Shortest path problem / Tree

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:16
46Graph theory / Mathematics / Edsger W. Dijkstra / Spanning tree / Combinatorial optimization / Network theory / Shortest path problem / Connectivity / Distributed computing / Minimum spanning tree / Clique / Matching

Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:35
47Graph connectivity / Graph theory / Edsger W. Dijkstra / Network theory / Shortest path problem / Bridge / Connected component / Connectivity / Graph / Routing algorithms / Planar separator theorem / Minimum spanning tree

JMLR: Workshop and Conference Proceedings vol 40:1–20, 2015 S2 : An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification Gautam Dasarathy

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:36
48Graph theory / Mathematics / NP-complete problems / NP-hard problems / Operations research / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Minimum spanning tree / Cycle / Line graph

Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2014-10-22 08:43:20
49

4.5 Minimum Spanning Tree Chapter 4 Greedy Algorithms Slides by Kevin Wayne.

Add to Reading List

Source URL: cgm.cs.mcgill.ca

Language: English - Date: 2012-01-09 15:08:28
    50Matching / Combinatorics / NP-complete problems / Combinatorial optimization / Spanning tree / Stable marriage problem / Approximation algorithm / 3-dimensional matching / Minimum spanning tree

    Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar

    Add to Reading List

    Source URL: www.cs.rpi.edu

    Language: English - Date: 2015-12-01 10:37:13
    UPDATE